Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(c(X, s(Y))) → f(c(s(X), Y))
g(c(s(X), Y)) → f(c(X, s(Y)))

Q is empty.


↳ QTRS
  ↳ AAECC Innermost

Q restricted rewrite system:
The TRS R consists of the following rules:

f(c(X, s(Y))) → f(c(s(X), Y))
g(c(s(X), Y)) → f(c(X, s(Y)))

Q is empty.

We have applied [15,7] to switch to innermost. The TRS R 1 is none

The TRS R 2 is

f(c(X, s(Y))) → f(c(s(X), Y))
g(c(s(X), Y)) → f(c(X, s(Y)))

The signature Sigma is {f, g}

↳ QTRS
  ↳ AAECC Innermost
    ↳ QTRS
      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(c(X, s(Y))) → f(c(s(X), Y))
g(c(s(X), Y)) → f(c(X, s(Y)))

The set Q consists of the following terms:

f(c(x0, s(x1)))
g(c(s(x0), x1))


Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F(c(X, s(Y))) → F(c(s(X), Y))
G(c(s(X), Y)) → F(c(X, s(Y)))

The TRS R consists of the following rules:

f(c(X, s(Y))) → f(c(s(X), Y))
g(c(s(X), Y)) → f(c(X, s(Y)))

The set Q consists of the following terms:

f(c(x0, s(x1)))
g(c(s(x0), x1))

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ AAECC Innermost
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

F(c(X, s(Y))) → F(c(s(X), Y))
G(c(s(X), Y)) → F(c(X, s(Y)))

The TRS R consists of the following rules:

f(c(X, s(Y))) → f(c(s(X), Y))
g(c(s(X), Y)) → f(c(X, s(Y)))

The set Q consists of the following terms:

f(c(x0, s(x1)))
g(c(s(x0), x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS
  ↳ AAECC Innermost
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

F(c(X, s(Y))) → F(c(s(X), Y))
G(c(s(X), Y)) → F(c(X, s(Y)))

The TRS R consists of the following rules:

f(c(X, s(Y))) → f(c(s(X), Y))
g(c(s(X), Y)) → f(c(X, s(Y)))

The set Q consists of the following terms:

f(c(x0, s(x1)))
g(c(s(x0), x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 1 less node.

↳ QTRS
  ↳ AAECC Innermost
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ QDP
                  ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

F(c(X, s(Y))) → F(c(s(X), Y))

The TRS R consists of the following rules:

f(c(X, s(Y))) → f(c(s(X), Y))
g(c(s(X), Y)) → f(c(X, s(Y)))

The set Q consists of the following terms:

f(c(x0, s(x1)))
g(c(s(x0), x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


F(c(X, s(Y))) → F(c(s(X), Y))
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
F(x1)  =  x1
c(x1, x2)  =  x2
s(x1)  =  s(x1)

Lexicographic path order with status [19].
Quasi-Precedence:
trivial

Status:
trivial


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ AAECC Innermost
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ QDP
                  ↳ QDPOrderProof
                    ↳ QDP
                      ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f(c(X, s(Y))) → f(c(s(X), Y))
g(c(s(X), Y)) → f(c(X, s(Y)))

The set Q consists of the following terms:

f(c(x0, s(x1)))
g(c(s(x0), x1))

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.